An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
نویسندگان
چکیده
منابع مشابه
An Asymptotic Determination of the Minimum Spanning Tree and Minimum Matching Constants in Geometrical Probability
Given n uniformly and independently distributed points in a ball of unit volume in dimension d, it is well established that the length of several combinatorial optimization problems (including the minimum spanning tree (MST), the minimum matching (M), the traveling salesman problem (TSP), etc.) on these n points is asymptotic to P(d) n(d-1)/d, where the constant B(d) depends on the dimension d ...
متن کامل4 Minimum Spanning Tree
This first algorithm is quite simple. (Though this was probably known earlier, its proof can be found in Prof. Indyk’s 1999 paper “Sublinear Time Algorithms for Metric Space Problems”.) Let Dij denote the distance between a pair of points i and j, over m total points. The entries of Dij must satisfy the triangle inequality; additionally the matrix is symmetric. Note that the matrix size (i.e., ...
متن کاملAn optimal minimum spanning tree algorithm
This thesis describes the optimal minimum spanning tree algorithm given by Pettie and Ramachandran (in Journal of the ACM, 2002). The algorithm presented finds a minimum spanning tree of a graph with n vertices and m edges deterministically in time O (T ∗ (m,n)), where T ∗ is the minimum number of edge-weight comparisons needed to determine the solution of the problem. The function T ∗ is the d...
متن کاملParallel Minimum Spanning Tree Algorithm
The Minimal Spanning Tree (MST) problem is a classical graph problem which has many applications in various areas. In this paper we discuss a concurrent MST algorithm derived from Prim’s algorithm presented by Setia et al. in 2009, targeting symmetric multiprocessing (SMP) with a shared address space. The pseudocode of the algorithm is presented, combined with three interesting heuristics in or...
متن کاملThe Minimum Spanning Tree of Maximum Entropy
In computer vision, we have the problem of creating graphs out of unstructured point-sets, i.e. the data graph. A common approach for this problem consists of building a triangulation which might not always lead to the best solution. Small changes in the location of the points might generate graphs with unstable configurations and the topology of the graph could change significantly. After buil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 1990
ISSN: 0167-6377
DOI: 10.1016/0167-6377(90)90066-e